package com.composite;

import java.util.ArrayList;
import java.util.List;

public class Main {
    static void tree(Node b, int depth){
        for(int i = 0; i < depth; i ++){
            System.out.print("-");
        }
        b.print();
        if(b instanceof BranchNode){
            for(Node n : ((BranchNode) b).nodes){
                tree(n, depth + 1);
            }
        }
    }

    public static void main(String[] args) {
        BranchNode root = new BranchNode("root");
        BranchNode chapter1 = new BranchNode("chapter1");
        BranchNode chapter2 = new BranchNode("chapter2");
        Node c11 = new LeafNode("c11");
        Node c12 = new LeafNode("c12");
        BranchNode b21 = new BranchNode("section b21");
        Node c211 = new LeafNode("c211");
        Node c212 = new LeafNode("c212");
        root.add(chapter1);
        root.add(chapter2);
        chapter1.add(c11);
        chapter1.add(c12);
        chapter2.add(b21);
        b21.add(c211);
        b21.add(c212);
        tree(root, 0);
    }
}

abstract class Node{
    abstract public void print();
}

class LeafNode extends Node{
    String content;
    public LeafNode(String content){
        this.content = content;
    }
    @Override
    public void print() {
        System.out.println(content);
    }
}

class BranchNode extends Node{
    List<Node> nodes = new ArrayList<>();
    String name;
    public BranchNode(String name){
        this.name = name;
    }

    @Override
    public void print() {
        System.out.println(name);
    }

    public void add(Node n){
        nodes.add(n);
    }
}